Facilitating non-contiguous allocation of a large object within a java heap

ABSTRACT

A chunking controller within a broker layer detects a large object, where a large object is one that the size of the allocation of the large object within a memory heap exceeds a maximum contiguous free space within the Java heap. The broker layer operates atop the Java Virtual Manager to facilitate communication and business processes between heterogeneous systems. The chunking controller describes the large object by an underlying array of the large object divided into multiple pieces of a size not exceeding the maximum contiguous free space. Then, the chunking controller enables requests through the broker layer for allocation by the Java Virtual Manager of each of the pieces of the large object within the Java heap, such that the broker layer facilitates efficient allocation of large objects in the Java heap managed by the Java Virtual Manager.

BACKGROUND OF THE INVENTION

1. Technical Field

The present invention relates in general to improved heap managementand, in particular, to improved efficiency of allocation of a largeobject within a heap. Still more particularly, the present inventionrelates to facilitating efficient non-contiguous allocation of a largeobject which is too large to fit within a contiguous free space within aJava heap by chunking the large object into multiple pieces at a brokerlayer.

2. Description of the Related Art

The Internet provides protocols that support one layer of connectivitybetween multiple computer systems distributed across multiple networks.However, while the Internet supports one layer of connectivity, toconnect the many diverse platforms operating via the Internet,additional layers of connectivity are required. In particular, toincrease business productivity, many companies now face the problem ofenabling additional layers of connectivity so that heterogeneous andgeographically distributed systems can communicate. On another level,companies face the problem of supporting both information and processesacross an enterprise's network of diverse systems and technologies.

One solution to the problem of supporting distribution of informationand processes across diverse systems is through the implementation of ahub and spoke type of infrastructure. In a hub and spoke infrastructure,a broker or other central infrastructure acts as a hub for straddlingexisting and new diverse systems and technologies to unite dissimilardata sources and applications.

In general, in a hub and spoke infrastructure, the hub receives datafrom many spokes, distributes the data among processes executing withinthe hub, and then returns the results to the spokes. The hub includesadapters that enable the hub to communicate with spokes implementing adiversity of protocols and data types. The adapters in the hub maytranslate, map, or reformat data so that the processes within the hubcan understand the data received from the spokes. The hub includesmultiple business processes to which the adapters pass data forprocessing. Once the business process complete execution, the hub maytranslate the resulting data so that the spoke receiving a result canunderstand the data.

In one example, the components within the hub that perform thereceiving, the distributing, and the returning may be written in Java(Java is a registered trademark of Sun Microsystems, Inc. in the UnitedStates and other countries). Java based components interact with a JavaVirtual Machine (JVM) (JVM is a registered trademark of SunMicrosystems, Inc. in the United States and other countries), which actsas the operating system for Java based applications. The Java VirtualMachine (JVM) runs atop the native operating system of the server orother computer system. The JVM accesses memory through the nativeoperating system, and, in particular, requests the allocation of a Javaheap, which is a contiguous portion of memory dedicated for use by theJVM. The JVM then receives allocation requests from the Java basedcomponents of the hub and controls allocation of the objects within theJava heap.

A common problem with JVM performance is that the JVM must locate acontiguous free space within the Java heap to allocate an object; if theJVM cannot locate a contiguous free space of sufficient size, then anOut of Memory error is returned to the Java component. This problem oflocating contiguous free space of sufficient size in the Java heapincreases as the size of allocation requests increases. In particular,as the JVM allocates and then deallocates objects within the Java heap,the free space in the Java heap becomes fragmented over time, leading tothe return of Out of Memory errors even when the total free space in theJava heap is large enough for an object allocation, because there is nocontiguous free space large enough for a particular object allocation.For example, because of fragmentation, a Java heap may include 100 MBtotal of free space, however, the largest contiguous free space is only1 MB, leading to the return of an Out of Memory error when the JVMattempts to allocate an object greater than 1 MB.

Because of the problem with the JVM returning Out of Memory errors whensufficient contiguous free space is not available for an allocation, acommon problem within a Java component based hub, such as the IBMWebSphere Interchange Server (IBM and WebSphere are registeredtrademarks of International Business Machines Corporation), is that asthe Java heap becomes fragmented, any data object passing through thehub that exceeds the size of the largest average free space within theJava heap, will cause the hub to stall. In particular, within the huband spoke architecture implemented through the IBM WebSphere InterchangeServer, it is common for the hub and spokes to pass batches of data inthe form of a data entity, known as a business object. Business objectsmay include arrays of data formatted to match a business objectdefinition known by the hub and a spoke. Business objects that includethe data needed for batch process handling may grow large as the data isaccumulated at the spoke into a business object. In addition, as eachJava component within the hub handles a business object, each Javacomponent may request additional allocations of the business object fromthe JVM within the Java heap and may increase the size of the businessobject during translations or clone multiple copies of the businessobject for distribution to multiple business processes within the hub.Thus, for example, a business object pulled off the transport layer ofthe hub that appears 10 MB in size may result in the allocation of manylarger Java objects in the Java heap, such as allocations of 30 MB ofcontiguous space in the Java heap, as the business object flows throughthe Java components of the hub. In the example, if the JVM is unable tolocate more than 10 MB of free space on the Java heap on average, thenthe JVM will return an Out of Error message that stalls the first Javacomponent requesting allocation of the business object as a Java objectwithin the Java heap. Thus, Out of Error messages received by Javacomponents within the hub are a problem because the Out of Errormessages delay the hub's handling of business objects and indicate thehub's inability to handle business transactions requiring transfers ofbatches of data larger than a typical maximum contiguous free spacesize.

Both the JVM and the Java components within a hub may include tuningparameters to aid a network administrator in reducing the frequency atwhich Out of Memory errors occur; however, adjustment of these tuningparameters only effectively adjusts the average maximum size ofcontiguous free space within the JVM and does not solve the problem ofhow to handle business objects larger than the maximum contiguous freespace when the total available free space is still greater than the sizeof the business object. For example, a hub administrator may increasethe size of the Java heap in an attempt to reduce the frequency at whichOut of Memory errors occur because more total heap space is available,however each operating system on top of which the JVM runs limits themaximum Java heap size and increasing the Java heap size does not changethe resulting fragmentation of free space within the Java heap. Inanother example, a hub administrator may set the rate at which businessobjects can flow through the Java components of the hub to reduce thenumber of business objects concurrently allocated in the Java heap,however, setting the flow rate of a business object through the hub doesnot change the fact that the JVM may not be able to locate sufficientcontiguous free space within the Java heap for allocation of a businessobject exceeding the maximum contiguous free space.

Therefore, in view of the foregoing, there is a need for a method,system, and program for enabling a Java based broker that facilitatesdistribution of data entities to business processes to efficientlyallocate data entities, such as business objects, exceeding the maximumcontiguous free space available in the Java heap, particularly when thetotal free space available in the Java heap exceeds the size of the dataentity. In particular, it would be advantageous to provide a method,system, and program for enabling allocation of large objects amongnon-contiguous free spaces to reduce fragmentation of the Java heap,without changing the manner in which the JVM allocates objects and in amanner that is transparent to the spokes and to other Java componentswithin the hub.

SUMMARY OF THE INVENTION

Therefore, an improved method, system, and program provide improved heapmanagement and, in particular, provide for improved efficiency ofallocation of large objects within a heap. Still more particularly, thepresent invention facilitates efficient non-contiguous allocation of alarge object which is too large to fit within a contiguous free spacewithin a Java heap by chunking the large object into multiple pieces ata broker layer.

According to one embodiment, a chunking controller within a broker layerdetects a large object, wherein a large object is one that the size ofthe allocation of the large object within a memory heap exceeds amaximum contiguous free space within the memory heap. The chunkingcontroller describes the large object by an underlying array of thelarge object divided into multiple pieces of a size not exceeding themaximum contiguous free space. Then, the chunking controller enablesrequests through the broker layer for allocation by the virtual managerlayer of each of the pieces of the large object within the memory heap,such that the broker layer facilitates efficient allocation of largeobjects in the memory heap managed by the virtual manager layer.

Architecturally, the broker layer operates atop the virtual managerlayer that interfaces with the operating system to manage allocationwithin the memory heap. The virtual manager layer only completesallocation requests when a contiguous free space within the heap ofsufficient size to meet the allocation request is available.

The broker layer includes multiple Java components that interface with aJava virtual manager that manages a Java heap. As business objects passbetween the Java components, the chunking controller detects whether thebusiness objects are large objects and thus in need of chunking. Asbusiness objects chunked into an underlying array pass between the Javacomponents that perform operations on the business objects, chunkingcontroller updates the underlying array to reflect the currentallocation of the business object within the Java heap.

The broker layer may operate within a hub system of a hub and spokeinfrastructure. The broker layer receives business objects a spoke,processes the business object, and returns a result to the same or adifferent spoke. When the chunking controller detects the broker layerpreparing a large object for transport to a spoke, the chunkingcontroller directs retrieval of the multiple pieces of the large objectfrom the memory heap and complies the multiple pieces of the largeobject into a buffer according to the underlying array description, suchthat the large object is transported to the spoke as a single, unchunkeddata entity.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features believed characteristic of the invention are setforth in the appended claims. The invention itself however, as well as apreferred mode of use, further objects and advantages thereof, will bestbe understood by reference to the following detailed description of anillustrative embodiment when read in conjunction with the accompanyingdrawings, wherein:

FIG. 1 is a block diagram depicting one embodiment of the hardware andsoftware implemented in a computer system through which the presentmethod, system, and program may be implemented;

FIG. 2 is a block diagram illustrating a hub and spoke infrastructure inaccordance with the method, system, and program of the presentinvention;

FIG. 3 is a block diagram depicting the components of a broker inaccordance with the method, system, and program of the presentinvention;

FIG. 4 is a block diagram depicting an illustrative example of theprogression of a chunked business object in accordance with the method,system, and program of the present invention; and

FIG. 5 is a high level logic flowchart depicting a process and programfor controlling efficient allocation of large business objects in a hubin accordance with the method, system, and program of the presentinvention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

Referring now to the drawings and in particular to FIG. 1, there isdepicted one embodiment of the hardware and software implemented in acomputer system through which the present method, system, and programmay be implemented. The present invention may be executed in a varietyof systems, including a variety of computing systems and electronicdevices.

Computer system 100 generally includes a bus 122 or other communicationdevice for communicating information within computer system 100, and atleast one processing device, such as processor 112 a, coupled to bus 122for processing information. Bus 122 preferably includes low-latency andhigher latency paths connected by bridges and adapters and controlledwithin computer system 100 by multiple bus controllers. When implementedas a server system, computer system 100 typically includes multipleprocessors, such as processors 112 a-112 n, that operate in parallel toimprove network servicing power.

Processors 112 a-112 n may be general-purpose or specified purposeprocessors that, during normal operation, operate under the control ofone or more of a number of different operating systems, such asoperating system 142, and execute various computer softwareapplications, programs, objects, modules and other processes from amemory 114. Although not depicted, memory 114 may include dynamicstorage such as random access memory (RAM) and static storage such asRead Only Memory (ROM). In addition, although not depicted, each ofprocessors 112 a-112 n may include levels of cache and registers localto a central processing unit.

In one embodiment, processors 112 a-112 n load a Java Virtual Machine(JVM) 140 in memory 114 on top of operating system 142. JVM 140 appearsas an application to (native) operating system 142, but in factfunctions as a virtual operating system, supporting Java application andJava components. In particular, Java components are preferably portableapplications that when run by JVM 140, can run on any platform,regardless of operating system or hardware specifications. Although notdepicted, JVM 140 compiles byte code from Java components and a Javainterpreter converts the byte code into instructions understandable byoperating system 142. The components of JVM 140 may be incorporated intoa standalone application, a part of an operating system, or a part of alarger application, such as a browser application or middleware. In analternate embodiment, JVM 140 and any of the components of JVM 140 may,at different times, reside in whole or in part in any of memory 114,mass storage device 118, network 102, or within registers or cache ofprocessors 112 a-112 n or other processor registers and cache.

JVM 140 requests that OS 142 allocation a portion of memory 114 to aJava heap 150. In particular, Java heap 150 is a contiguous memory spaceinto which only JVM 140 may allocate Java objects. JVM 140 tracks thefree spaces within Java heap 150 and may periodically perform a garbagecollection procedure to free Java heap 150 of Java objects no longerneeded. In one embodiment, JVM 140 only satisfies an allocation requestif a contiguous free space of sufficient size is available for theallocation request. In another embodiment, JVM 140 may break anallocation request into multiple pieces and allocate each piece within acontiguous free space; JVM 140 must then manage the compilation of theJava object any time JVM 140 needs to access the Java object.

In one embodiment, broker components 146 include Java components thatprovide the application infrastructure for computer system 100 tofunction as a broker system. Generally, broker components 146 mayinclude Java components that support the distribution of data entitiesto processes. In particular, as will be further described, brokercomponents 146 may include Java components that support theimplementation of a hub and spoke type infrastructure. In a hub andspoke infrastructure, broker components 146 function to provide a hubfor straddling existing and new diverse systems and technologies tounite dissimilar data sources and applications. One example of computersystem 100 executing broker components 146 is an IBM WebSphereInterchange Server. In addition, as will be further described, whencomputer system 100 functions as a spoke, computer system 100 mayinclude JVM 140 with spoke components that enable connectivity with thehub. Advantageously, in supporting the distribution of data entities toprocesses, broker components 146 enable efficient allocation of dataentities of a size that exceeds the maximum contiguous free spaceavailable in Java heap 150, but does not exceed the total available freespace available in the Java heap 150.

In one embodiment, operating system software 142, JVM 140, or brokercomponents 146 contains machine executable instructions, that whenexecuted on processor 112, carry out the operations depicted in theflowchart of FIG. 5, and other operations described herein.Alternatively, the steps of the present invention might be performed byspecific hardware components that contain hardwired logic for performingthe steps, or by any combination of programmed computer components andcustom hardware components.

The present invention may be provided as a computer program product,included on a machine-readable medium having stored thereon the machineexecutable instructions used to program computer system 100 to perform aprocess according to the present invention. The term “machine-readablemedium” as used herein includes any medium that participates inproviding instructions to processors 112 a-112 n or other components ofcomputer system 100 for execution. Such a medium may take many formsincluding, but not limited to, non-volatile media, volatile media, andtransmission media. Common forms of non-volatile media include, forexample, a floppy disk, a flexible disk, a hard disk, magnetic tape orany other magnetic medium, a compact disc ROM (CD-ROM) or any otheroptical medium, punch cards or any other physical medium with patternsof holes, a programmable ROM (PROM), an erasable PROM (EPROM),electrically EPROM (EEPROM), a flash memory, any other memory chip orcartridge, or any other medium from which computer system 100 can readand which is suitable for storing instructions. In the presentembodiment, an example of a non-volatile medium is mass storage device118 is an example of a non-volatile medium, depicted as an internalcomponent of computer system 100, but it will be understood an externaldevice may also provide mass storage device 118. Volatile media includedynamic memory such as RAM. Transmission media include coaxial cables,copper wire or fiber optics, including the wires that comprise bus 122.Transmission media can also take the form of acoustic or light waves,such as those generated during radio frequency or infrared datacommunications.

Moreover, the present invention may be downloaded as a computer programproduct, wherein a remote system, such as server 136, may transfer theprogram instructions to requesting computer system 100 by way of datasignals embodied in a carrier wave or other propagation medium via anetwork link 134 (e.g. a modem or network connection) to acommunications interface 132 coupled to bus 122. Communicationsinterface 132 provides a data communications coupling to network link134 that may connect, for example, to a local area network (LAN), widearea network (WAN), or directly to an Internet Service Provider (ISP).In particular, network link 134 may provide wired and/or wirelessnetwork communications to one or more networks.

Network link 134 in turn provides data communication services throughnetwork 102. Network 102 may refer to the worldwide collection ofnetworks and gateways that use a particular protocol, such asTransmission Control Protocol (TCP) and Internet Protocol (IP), tocommunicate with one another. Network link 134 and network 102 both useelectrical, electromagnetic, or optical signals that carry digital datastreams. The signals through the various networks and the signals onnetwork link 134 and through communication interface 132, which carrythe digital data to and from computer system 100, are exemplary forms ofcarrier waves transporting the information.

In addition to server 136, network 102 may provide access to any numberof computers and other devices. Further, operating system 142, JVM 140,and various applications, programs, objects, modules and other processesmay execute on one or more processors in server 136 and other computersystems accessible via network 102 in a distributed environment. Inparticular, when implemented as a server system, computer system 100typically includes multiple communication interfaces accessible viamultiple peripheral component interconnect (PCI) bus bridges connectedto an input/output controller. In this manner, computer system 100allows connections to multiple networked accessible computers.

In addition, computer system 100 typically includes multiple peripheralcomponents that facilitate communication. These peripheral componentsare connected to multiple controllers, adapters, and expansion slotscoupled to one of the multiple levels of bus 122 and herein referred toby I/O interface 130.

Those of ordinary skill in the art will appreciate multiple types ofsystems may implement the hardware depicted in FIG. 1 and that thehardware depicted in FIG. 1 may vary. For example, computer 100 includea standard computer or server, but can also include an embedded system,such as a set top box, handheld device, or any other hardware deviceincluding a processor and JVM 140. Furthermore, those of ordinary skillin the art will appreciate that the depicted example is not meant toimply architectural limitations with respect to the present invention.

With reference now to FIG. 2, there is depicted a block diagramillustrating a hub and spoke infrastructure in accordance with themethod, system, and program of the present invention. As illustrated, ahub and spoke infrastructure 200 includes a hub 202 and multiple spokes204, 206 and 208. In particular, a system including broker components146 facilitates hub 202 for management of business processes andcommunications between the systems characterized as spokes 204, 206, and208. Spokes 204, 206, and 208 may also include broker components. Inaddition, it will be understood that spokes 204, 206, and 208 aredepicted for purposes of illustration and not as a limitation on thenumber of spokes or the organization of spokes.

Hub 202 and spokes 204, 206, and 208 may include heterogeneous orhomogeneous systems accessible within an intranet, via the Internet, orwithin another network environment. Each of spokes 204, 206, and 208 mayperform as client systems or server systems that implement differentcommunication platforms. For example, any of spokes 204, 206, and 208may implement browsers that support Hypertext Markup Language (HTML) andeXtensible Markup Language (XML) or may include applets and Javaapplications that request and receive information from hub 202. Further,hub 202 and spokes 204, 206, and 208 may include, for example, webservers, application servers, and servers that implement servlets, JSPs,Enterprise Java Beans (EJBs), Java Message Service (JMS), Java Namingand Directory Interface (JNDI), Common Object Request BrokerArchitecture (CORBA), and Customer Information Control Systems (CICSs),for example. In addition, spokes 204, 206, and 208 may include backendsystems that provide databases, web services, and other resources,through Java Database Connectivity (JDBC), for example.

Communication channels are established between hub 202 and spokes 204,206, and 208. For example, communication channels may implement adaptersthat enable communications in Hypertext Transfer Protocol (HTTP),Internet Inter-orb Protocol (IIOP), Remote Method Invocation (RMI),Simple Object Access Protocol (SOAP), and a Secure Socket Layer (SSL)and may include a firewall or other security layer. In addition,adapters may include connectors, queues, and other interfaces thatenable communication.

Referring now to FIG. 3, there is depicted a block diagram of thecomponents of a broker in accordance with the method, system, andprogram of the present invention. For purposes of example, thecomponents of hub 202 and spokes 204 and 206 are illustrated, where datais exchanged between hub 202 and spokes 204 and 206 and data is passedthrough hub 202 in the form of business objects. It will be understoodthat the components illustrated in hub 202 and spokes 204 and 206 aremerely for purposes of illustration and are not intended as structurallimitations of a broker system implementing the present invention.

In the example, spoke 204 includes an adapter agent 302 that accumulatesdata into an application specific business object (ASBO) defined by aspecific application and controls placement of the ASBO to transportmechanism 304 of hub 202. For example, spoke 204 may include an SAPbased application (SAP is a registered trademark of SAP AG in Germanyand in several other countries), such that adapter agent 302 accumulatesSAP defined data into an SAP ASBO.

While in the example hub 202 only receives an ASBO from spoke 204,practically, hub 202 may receive many ASBOs from many spokes within ashort period of time. Thus, hub 202 requires a transport mechanism 304that receives multiple types of data from multiple sources and queuesthe data until it is pulled off the queue by adapter controllers withinhub 202. In one example, transport mechanism 304 implements IBMWebSphere MQSeries (MQSeries is a registered trademark of InternationalBusiness Machines Corporation) to perform queuing and distribution.

In particular, a thread within transport mechanism 304 will pull ASBOsoff the queue in transport mechanism 304 and distribute the ASBO to anadapter controller of a type that corresponds with the adapter agent. Inthe example, adapter controller 306 corresponds to adapter agent 302,and thus the ASBO is pulled off transport mechanism 304 and placed withadapter controller 306. Although not depicted, adapter controller 306may include a queue into which transport mechanism 304 places ASBOs ofthe type handled by adapter controller 306. Then, one of multiplethreads associated with adapter controller 306 may pick the ASBO offadapter controller 306 and map the ASBO to a generic business object(GBO) understood by the collaborations available in hub 202.

Adapter controller 306 passes the mapped GBO to collaboration manager308, where collaboration manager 308 controls the distribution of theGBO to a collaboration 310 that performs a particular business processor transaction with the GBO. It will be understood that adaptercontroller 306 may pass the mapped GBO to multiple collaborationmanagers that control different types of collaborations and that eachcollaboration manager may clone a GBO and pass the GBO to multiplecollaborations of the same type.

Once collaboration 310 completes processing of the GBO, collaboration310 calls an adapter controller for the destination location. In theexample, collaboration 310 calls adapter controller 312. Adaptercontroller 312 maps the GBO into an ASBO of a type understood by anadapter agent 316 at spoke 306. Then, a service call controller 314places a call to adapter agent 316 and passes the ASBO to adapter agent316 when adapter agent 316 indicates readiness. In one embodiment,logically, service call controller 314 is part of transport mechanism304 that facilitates the sending of business objects. Service callcontroller 314 may include an outgoing buffer 322 for holding outgoingbusiness objects retrieved from the Java heap.

In the example, each of transport mechanism 304, adapter controller 306and collaboration manager 308 may be Java components that interact withJVM 140 to request allocation of the business object as a Java objectwithin Java heap 150. In particular, in the example, when a transportmechanism thread pulls the ASBO off of the queue within transportmechanism 302, the thread requires allocation of the ASBO within the JVMas a Java object. Then, when the adapter thread within adaptercontroller 304 maps the ASBO to a GBO, the required allocation space ofthe Java object for the GBO within Java heap 150 grows. Further, athread within collaboration manager 308 may require allocation ofadditional copies of the GBO by JVM 140 within Java heap 150 for eachcollaboration.

According to an advantage of the invention, when a business objectalready exceeds a maximum free space size or is anticipated to exceed amaximum free space size, a chunk controller 320 may chunk the businessobject into multiple underlying pieces and request allocation of each ofthe underlying pieces individually by JVM 140. By requesting allocationof each of the underlying pieces individually by the JVM 140, ratherthan in one allocation, JVM 140 only needs to locate sufficientcontiguous free space for each piece individually, rather thansufficient contiguous free space for the entire business object.Importantly, the manner in which JVM 140 allocates objects is notchanged, just the size and number of allocation requests for objects isadjusted by chunk controller 320 at the broker component layer. It isimportant to note that while chunk controller 320 is depicted as anindependent component within hub 202 that can monitor a business objectat any point within hub 202, chunk controller 320 may also beincorporated within a particular component of hub 202.

Chunk controller 320 describes the underlying pieces of the chunkedbusiness object in an array or list of the pieces associated with thebusiness object. Thus, as the business object is passed betweencomponents of hub 202, the components view the business object as asingle data entity and the business object is passed to spoke 306 as asingle data entity, however, the business object is viewed by the JVM aspieces. As each components of hub 202 manipulates the business object,choke controller 320 may adjust the array describing the underlyingpieces of the business object to reflect additional allocations. Then,when chunk controller 320 detects service call controller 314 receivinga business object for transport, chunk controller 320 directs servicecall controller 314 to request retrieval of each of the underlyingpieces of the business object described in the chunk array from the JVMheap and combine the pieces in the outgoing business object queueaccording to the map of the business object in the chunk array. Thus,the division of the business object into multiple pieces allocatedwithin Java heap 150 is transparent to spokes 204 and 206.

With reference now to FIG. 4, there is depicted an illustrative exampleof the progression of a chunked business object in accordance with themethod, system, and program of the present invention. As depicted, abusiness object 402 is 10 MB in size. A maximum object size setting 406within chunking controller 320 is set to a maximum object size of 1 MB.Thus, chunking controller 320 will detect that business object 402exceeds the maximum object size and initiate chunking business object402 and requesting allocation of the individual pieces of the chunkedbusiness object 402 by JVM 140.

In the example, chunking controller 320 chunks business object 402 intoten 1 MB pieces described by a chunked list. In particular, theunderlying pieces of business object 402 described by the chunked listare demonstratively illustrated within a list buffer 404. It will beunderstood that the pieces of business object 402 may also be describedin an array or other data structure that is able to describe theunderlying pieces of business object 402. In addition, although notdepicted, list buffer 404 maintains a reference to the allocationlocations of each of the pieces within Java heap 140.

Chunking controller 320 then directs an allocation request to besubmitted to JVM 140 for each of the underlying pieces illustrated inlist buffer 404. JVM 140 may then control allocation of each of the 1 MBpieces within 1 MB contiguous free spaces within Java heap 150. In theexample, allocated spaces 412, 414, and 416 are not free space withinJava heap 150; the 1 MB pieces are allocated within the free spacessurrounding allocates spaces 412, 414, and 416 within Java heap 150.

As hub 202 passes business object 402 from one component within hub 202to another, the chunked list illustrated by list buffer 404 may bepassed from component to component or may be maintained within a singlebuffer location. It will be understood that each component maymanipulate business object 402, requiring adjustment to list buffer 404as new allocation requests are required. Further, it will be understoodthat chunking controller 320 may initiate chunking of business object402 at any component within the hub when the size of the free spaceneeded for allocation of business object 402 exceeds maximum object sizesetting 406.

An administrator may adjust the value of maximum object size setting406. Alternatively, chunking controller 320 may automatically set thevalue of maximum object size setting 406 according to the currentcontiguous free space available in Java heap 150. In addition, othermethods of setting maximum object size setting 406 may be implemented.

In the present example, chunking controller 320 divides business object402 into pieces of a uniform size equal to maximum object size setting406. In alternate embodiments, however, chunking controller 320 maydivide business object 402 into pieces of a size different than maximumobject size setting 406 and may divide business object 402 into piecesof different sizes.

Referring now to FIG. 5, there is depicted a high level logic flowchartof a process and program for controlling efficient allocation of largebusiness objects in a hub in accordance with the method, system, andprogram of the present invention. As depicted, the process starts atblock 500 and thereafter proceeds to block 502. Block 502 depicts adetermination whether a chunk controller detects a JVM allocationrequest for a business object in the hub where the allocation requestsize is larger than a maximum object size. If the chunk controllerdetects a JVM allocation request size larger than a maximum object size,then the process passes to block 504. Block 504 depicts converting abusiness object into an underlying array of pieces described in abuffer. Next, block 506 depicts requesting allocation of each piece fromthe JVM. Thereafter, block 508 depicts a determination whether thechunking controller detects transport preparation for the businessobject. If the chunking controller does not detect transport preparationfor the business object, then the process passes to block 512. If thechunking controller does detect transport preparation for the businessobject, then the process passes to block 510. Block 510 depictsrecompiling the pieces of the business object from the JVM into atransport buffer according to the underlying array for transporting thebusiness object from the hub, and the process ends.

Block 512 depicts a determination whether the chunking controllerdetects additional allocation requests for the business object as itpasses through additional Java components within the broker layer. If noadditional requests are detected, then the process returns block 508. Ifan additional allocation request is detected, then the process passes toblock 514. Block 514 depicts adjusting the underlying array of pieces ofthe business object described in the buffer. Next, block 516 depictsrequesting allocation of each piece through the JVM, and the processreturns to block 508. Alternatively, the additional allocation requestsmay just request allocation of those pieces adjusted by the Javacomponent.

While the invention has been particularly shown and described withreference to a preferred embodiment, it will be understood by thoseskilled in the art that various changes in form and detail may be madetherein without departing from the spirit and scope of the invention.

1. A system for facilitating efficient allocation of large objects in amemory heap, comprising: a server system communicatively connected to anetwork; a broker layer running within said server system for detectinga large object passing through said server system, wherein a sizerequired for allocation of said large object within a memory heapexceeds a maximum contiguous free space within said memory heap, whereinsaid broker layer operates on top of a virtual manager layer thatmanages allocations within said memory heap and for passing said largeobject between a plurality of components of said broker layer wherein atleast one of said plurality of components requires additional allocationspace for said large object, wherein said plurality of components viewsaid large object as a single data entity and said virtual manager layerviews said large object as said plurality of pieces; and a chunkingcontroller within said broker layer for describing said large object byan underlying array of said large object divided into a plurality ofpieces of a size not exceeding said maximum contiguous free space,requesting, by said broker layer, allocation by said virtual managerlayer of each of said plurality of pieces within said memory heap,detecting an allocation request for said large object by one of aplurality of components receiving said large object within said brokerlayer to said virtual manager layer, and adjusting said underlying arrayto reflect said allocation request for said large object.
 2. The systemaccording to claim 1 for facilitating efficient allocation of largeobjects in a memory heap, said broker layer further comprising: meansfor detecting said large object at a point within said broker layercomprising at least one from among said large object pulled off atransport mechanism for said broker layer, said large object mapped intoa generic object, and said large object cloned for distribution toprocesses within said broker layer.
 3. The system according to claim 1for facilitating efficient allocation of large objects in a memory heap,wherein said virtual manager layer only completes an allocation requestif a contiguous free space within said memory heap of sufficient sizefor said allocation request is available.
 4. The system according toclaim 1 for facilitating efficient allocation of large objects in amemory heap, said chunking controller further comprising: means fordetecting said broker layer preparing said large object for transport toa spoke; means for retrieving said plurality of pieces of said largeobject from said memory heap through a request to said virtual managerlayer; and means for compiling said plurality of pieces back into saidlarge object in a buffer according to said underlying array description,wherein said large object is transported as a single data entity.
 5. Thesystem according to claim 1 for facilitating efficient allocation oflarge objects in a memory heap, wherein said large object is a dataentity.
 6. The system according to claim 1 for facilitating efficientallocation of large objects in a memory heap, wherein said serversystem, through said broker layer, enables communication between aplurality of heterogeneous spoke systems by receiving and distributingcommunications in a plurality of protocols.
 7. The system according toclaim 1 for facilitating efficient allocation of large objects in amemory heap, wherein said broker layer comprises a plurality ofcomponents and said virtual manager layer is a virtual manager thatmanages said memory heap as a heap of contiguous memory.
 8. The systemaccording to claim 1 for facilitating efficient allocation of largeobjects in a memory heap, further comprising: said broker layer forreceiving a plurality of application specific objects each defined by aparticular application from among a plurality of applications into aqueue of a transport mechanism; said broker layer, responsive to athread pulling a next application specific object off said queue, fordetecting whether said next application specific object is said largeobject; said thread for distributing said next application specificobject to a particular adapter controller of a type for handling a typeof application of said next application specific object from among aplurality of adapter controllers, wherein said plurality of componentscomprises said plurality of adapter controllers; an adapter thread ofsaid particular adapter controller for mapping said next specific objectinto a general business object and requesting an additional allocationrequest for additional allocation space to said large object for saidgeneral business object to said virtual manager layer; said adapterthread for passing said general business object to a collaborationmanager for controlling distribution of said general business object toat least one collaboration, wherein said plurality of componentscomprises said collaboration manager; and said collaboration manager forrequesting a next allocation request for additional allocation space tosaid large object for at least one copy of said general business objectto said virtual manager layer.
 9. A computer program product, residingon a volatile or non-volatile computer readable medium, for facilitatingefficient allocation of large objects in a memory heap, comprising:means for enabling detection of a large object within a broker layerhandling said large object, wherein a size required for allocation ofsaid large object within a memory heap exceeds a maximum contiguous freespace within said memory heap, wherein said broker layer operates on topof a virtual manager layer that manages allocations within said memoryheap; means for describing, by said broker layer, said large object byan underlying array of said large object divided into a plurality ofpieces of a size not exceeding said maximum contiguous free space; meansfor controlling a request by said broker layer for allocation by saidvirtual manager layer of each of said plurality of pieces within saidmemory heap; means for tracking passage of said large object within saidbroker layer between a plurality of components wherein at least one ofsaid plurality of components requires additional allocation space forsaid large object, wherein said plurality of components view said largeobject as a single data entity and said virtual manager layer views saidlarge object as said plurality of pieces; means for enabling detectionby said broker layer of an allocation request for said additionalallocation space for said large object from one of said plurality ofcomponents to said virtual manager layer; and means for controllingadjustment by said broker layer of said underlying array to reflect saidallocation request for said large object.
 10. The computer programproduct according to claim 9 for facilitating efficient allocation oflarge objects in a memory heap, wherein said means for enablingdetection of a large object within a broker layer handling said largeobject, further comprises: means for enabling detection of said largeobject at a process within said broker layer comprising at least onefrom among said large object pulled off a transport mechanism for saidbroker layer, said large object mapped into a generic object, and saidlarge object cloned for distribution to processes within said brokerlayer.
 11. The computer program product according to claim 9 forfacilitating efficient allocation of large objects in a memory heap,further comprising: means for enabling detection of said broker layerpreparing said large object for transport to a spoke; means for enablingretrieval of said plurality of pieces of said large object from saidmemory heap through a request to said virtual manager layer; and meansfor controlling compilation of said plurality of pieces back into saidlarge object in a buffer according to said underlying array description,wherein said large object is transported as a single data entity. 12.The computer program product according to claim 9 for facilitatingefficient allocation of large objects in a memory heap, furthercomprising: means for receiving a plurality of application specificobjects each defined by a particular application from among a pluralityof applications into a queue of a transport mechanism of said brokerlayer; means, responsive to a thread pulling a next application specificobject off said queue, for detecting by said broker layer whether saidnext application specific object is said large object; means fordistributing, by said thread, said next application specific object to aparticular adapter controller of a type for handling a type ofapplication of said next application specific object from among aplurality of adapter controllers, wherein said plurality of componentscomprises said plurality of adapter controllers; means for mapping, byan adapter thread of said particular adapter controller, said nextspecific object into a general business object; means for requesting, bysaid adapter thread an additional allocation request for additionalallocation space to said large object for said general business objectto said virtual manager layer; means for passing said general businessobject to a collaboration manager for controlling distribution of saidgeneral business object to at least one collaboration, wherein saidplurality of components comprises said collaboration manager; and meansfor requesting, by said collaboration manager, a next allocation requestfor additional allocation space to said large object for at least onecopy of said general business object to said virtual manager layer.